k out of n NonBinary Audio Cryptography Using Polynomial Interpolation
نویسنده
چکیده
Audio cryptography is same like a visual cryptography. A plain data (audio file) is split into two or more shares. Each single share does not convey any meaning but when shares are combined together they will reveal the original data. In Audio cryptography the "plaintext" is an audio File. k out of n Nonbinary Audio Cryptography scheme is a special type of secret sharing scheme which is more secure than previous method. This scheme is (k, n) threshold where 2 k n. Instead of bit string message audio file is used. It uses an audio file its self is a secret file . After creating a shares that shares is embedded into a another innocent audio file by using LSB hiding technique. So if an eavesdropper plays one share in a media player, he or she will only hear simple audio file which is cover file. So no one is able to recognize it contain a secret audio. In a reconstruction secret is extracted and reconstructed and cover file is removed. Keywords— NonBinary Audio Cryptography, Audio Secret Sharing Scheme, audio embedding, LSB hiding
منابع مشابه
Fast interpolating algorithms in cryptography
We present two fast polynomial interpolating algorithms with knots generated in a field K by the recurrent formula of the form ( ) 1 0 1,2,.., 1; i i x x i n x α β γ − = + = − = . The running time of them is ( ) ( ) C n O n + base operations from K, where ( ) ( ) 2 log C n O n n = denotes the time needed to compute the wrapped convolution in K. Moreover, we give an application of these algorith...
متن کاملCryptography through Interpolation, Approximation and Computational Intelligence Methods
Recently, numerous techniques and methods have been proposed to address hard and complex algebraic and number theoretical problems related to cryptography. We review several interpolation and approximation techniques. In particular, we discuss techniques related to polynomial interpolation, discrete Fourier transforms, as well as, polynomial approximation. Subsequently, we focus on a recently p...
متن کاملEfficient Polynomial Operations in the Shared-Coefficients Setting
We study the design of efficient and private protocols for polynomial operations in the shared-coefficients setting. We propose efficient protocols for polynomial multiplication, division with remainder, polynomial interpolation, polynomial gcd, and a few other operations. All the protocols introduced in this paper are constant-round, and more efficient than the general MPC. The protocols are a...
متن کاملAitken and Neville inverse interpolation methods for the Lucas logarithm problem
The Lucas function is a recently proposed one-way function used in public key cryptography. The security of cryptosystems based on the Lucas function relies on the difficulty of solving the Lucas logarithm problem. In this paper, the Lucas logarithm problem is studied using interpolation techniques. In particular, the inverse Aitken and the inverse Neville interpolation methods are applied to v...
متن کامل